Fast Morphological Attribute Operations Using Tarjan's Union-Find Algorithm
نویسندگان
چکیده
Morphological attribute openings and closings and related operators are generalizations of the area opening and closing, and allow filtering of images based on a wide variety of shape or size based criteria. A fast union-find algorithm for the computation of these operators is presented in this paper. The new algorithm has a worst case time complexity of O(N logN) where N is the image size, as opposed to O(N2 logN) for the existing algorithm. Memory requirements are O(N) for both algorithms.
منابع مشابه
Ruminations on Tarjan's Union-Find Algorithm and Connected Operators
This papers presents a comprehensive and general form of the Tarjan’s unionfind algorithm dedicated to connected operators. An interesting feature of this form is to introduce the notion of separated domains. The properties of this form and its flexibility are discussed and highlighted with examples. In particular, we give clues to handle correctly the constraint of domain-disjointness preserva...
متن کاملFast computation of morphological area pattern spectra
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tarjan’s union-find algorithm. These spectra provide rotation, translation, and scale invariant pattern vectors for texture analysis.
متن کاملA Comparison of Algorithms for Connected Set Openings and Closings
ÐThe implementation of morphological connected set operators for image filtering and pattern recognition is discussed. Two earlier algorithms based on priority queues and hierarchical queues, respectively, are compared to a more recent union-find approach. Unlike the earlier algorithms which process regional extrema in the image sequentially, the union-find method allows simultaneous processing...
متن کاملFast Implementation of Morphological Filtering Using ARM NEON Extension
In this paper we consider speedup potential of morphological image filtering on ARM processors. Morphological operations are widely used in image analysis and recognition and their speedup in some cases can significantly reduce overall execution time of recognition. More specifically, we propose fast implementation of erosion and dilation using ARM SIMD extension NEON. These operations with the...
متن کاملThe Union-Find Problem Is Linear
The union-find problem, also known as the disjoint set union problem, involves two operations, union and find, on a collection of disjoint sets. The worst case time complexity of a sequence of n such operations was known to be near linear. We prove that its worst case time complexity is linear. The new proof technique is based on amortized complexity analysis and transformation. Our proof is su...
متن کامل